Approximation algorithms for orthogonal packing problems for hypercubes
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملParameterized approximation algorithms for packing problems
In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cost of computing approximate solutions. Consider a packing problem for which there is no known algorithm with approximation ratio α, and a parameter k. If the value of an optimal solution is at least k, we seek a soluti...
متن کاملHardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملEfficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
We provide improved approximation algorithms for several rectangle tiling and packing problems RTILE DRTILE and d RPACK studied in the literature Most of our algorithms are highly e cient since their running times are near linear in the sparse input size rather than in the domain size In addition we improve the best known approximation ratios
متن کاملApproximation algorithms for scheduling and two-dimensional packing problems
This dissertation thesis is concerned with two topics of combinatorial optimization: scheduling and geometrical packing problems. Scheduling deals with the assignment of jobs to machines in a ‘good’ way, for suitable notions of good. Two particular problems are studied in depth: on the one hand, we consider the impact of machine failure on online scheduling, i.e. what are the consequences of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.030